Fermat's polygonal number theorem for repeated generalized polygonal numbers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polygonal Numbers

In the article the formal characterization of triangular numbers (famous from [15] and words “EYPHKA! num = ∆ + ∆ + ∆”) [17] is given. Our primary aim was to formalize one of the items (#42) from Wiedijk’s Top 100 Mathematical Theorems list [33], namely that the sequence of sums of reciprocals of triangular numbers converges to 2. This Mizar representation was written in 2007. As the Mizar lang...

متن کامل

Generalized Swept Mid-structure for Polygonal Models

We introduce a novel mid-structure called the generalized swept mid-structure (GSM) of a closed polygonal shape, and a framework to compute it. The GSM contains both curve and surface elements and has consistent sheet-by-sheet topology, versus triangle-by-triangle topology produced by other mid-structure methods. To obtain this structure, a harmonic function, defined on the volume that is enclo...

متن کامل

Magic Numbers in Polygonal and Polyhedral Clusters

Certain values for the nuclearity of clusters tend to occur more frequently than others. This paper gives a mathematical derivation of the preferred values of nuclearity (the “magic numbers”) corresponding to various symmetrical, close-packed polygons (in two dimensions) and polyhedra (in three dimensions). Simple general formulas are obtained for the numbers of atoms in these clusters. Explici...

متن کامل

A Diophantine Problem concerning Polygonal Numbers

Motivated by some earlier Diophantine works on triangular numbers by Ljunggren and Cassels, we consider similar problems for general polygonal numbers.

متن کامل

On Universal Sums of Polygonal Numbers

For m = 3, 4, . . . , the polygonal numbers of order m are given by pm(n) = (m−2) ` n 2 ́ +n (n = 0, 1, 2, . . . ). For positive integers a, b, c and i, j, k > 3 with max{i, j, k} > 5, we call the triple (api, bpj , cpk) universal if for any n = 0, 1, 2, . . . there are nonnegative integers x, y, z such that n = api(x)+bpj(y)+cpk(z). We show that there are only 95 candidates for universal triple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2021

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2020.05.024